Algorithms and inference for simultaneous-event multivariate point-process, with applications to neural data

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 115-118).The formulation of multivariate point-process (MPP) models based on the Jacod likelihood does not allow for simultaneous occurrence of events at an arbitrarily small time resolution. In this thesis, we introduce two versatile representations of a simultaneous event multivariate point-process (SEMPP) model to correct this important limitation. The first one maps an SEMPP into a higher-dimensional multivariate point-process with no simultaneities, and is accordingly termed the disjoint representation. The second one is a marked point-process representation of an SEMPP, which leads to new thinning and time-rescaling algorithms for simulating an SEMPP stochastic process. Starting from the likelihood of a discrete-time form of the disjoint representation, we present derivations of the continuous likelihoods of the disjoint and MkPP representations of SEMPPs. For static inference, we propose a parametrization of the likelihood of the disjoint representation in discrete-time which gives a multinomial generalized linear model (mGLM) algorithm for model fitting. For dynamic inference, we derive generalizations of point-process adaptive filters. The MPP time-rescaling theorem can be used to assess model goodness-of-fit. We illustrate the features of our SEMPP model by simulating SEMPP data and by analyzing neural spiking activity from pairs of simultaneously-recorded rat thalamic neurons stimulated by periodic whisker deflections. The SEMPP model demonstrates a strong effect of whisker motion on simultaneous spiking activity at the one millisecond time scale. Together, the MkPP representation of the SEMPP model, the mGLM and the MPP time-rescaling theorem offer a theoretically sound, practical tool for measuring joint spiking propensity in a neuronal ensemble.by Demba Ba.Ph.D

Nonlinear transform coding with lossless polar coordinates

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 51-52).In conventional transform coding, the importance of preserving desirable quantization partition cell shapes prevents one from considering the use of a nonlinear change of variables. If no linear transformation of a given source would yield independent components, this means having to encode it at a rate higher than its entropy, i.e. suboptimally. This thesis proposes a new transform coding technique where the source samples are first uniformly scalar quantized and then transformed with an integer-to-integer approximation to a nonlinear transformation that would give independent components. In particular, we design a family of integer-to-integer approximations to the Cartesian-to-polar transformation and analyze its behavior for high rate transform coding. Among the benefits of such an approach is the ability to achieve redundancy reduction beyond decorrelation without limitation to orthogonal linear transformations of the original variables. A high resolution analysis is given, and for source models inspired by a sensor network application and by image compression, simulations show improvements over conventional transform coding. A comparison to state-of-the-art entropy-coded polar quantization techniques is also provided.by Demba Elimane Ba.S.M

Nonlinear Transform Coding with Lossless Polar Coordinates

In conventional transform coding, the importance of preserving desirable quantization partition cell shapes prevents one from considering the use of a nonlinear change of variables. If no linear transformation of a given source would yield independent components, this means having to encode it at a rate higher than its entropy, i.e. suboptimally. This thesis proposes a new transform coding technique where the source samples are first uniformly scalar quantized and then transformed with an integerto-integer approximation to a nonlinear transformation that would give independent components. In particular, we design a family of integer-to-integer approximations to the Cartesian-to-polar transformation and analyze its behavior for high rate transform coding. Among the benefits of such an approach is the ability to achieve redundancy reduction beyond decorrelation without limitation to orthogonal linear transformations of the original variables. A high resolution analysis is given, and for source models inspired by a sensor network application and by image compression, simulations show improvements over conventional transform coding. A comparison t